Essential countability of treeable equivalence relations

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Essential countability of treeable equivalence relations

We establish a dichotomy theorem characterizing the circumstances under which a treeable Borel equivalence relation E is essentially countable. Under additional topological assumptions on the treeing, we in fact show that E is essentially countable if and only if there is no continuous embedding of E1 into E. Our techniques also yield the first classical proof of the analogous result for hypers...

متن کامل

Treeable equivalence relations

There are continuum many ≤B-incomparable equivalence relations induced by a free, Borel action of a countable non-abelian free group – and hence, there are 20 many treeable countable Borel equivalence relations which are incomparable in the ordering of Borel reducibility

متن کامل

FUZZY SUBGROUPS AND CERTAIN EQUIVALENCE RELATIONS

In this paper, we study an equivalence relation on the set of fuzzysubgroups of an arbitrary group G and give four equivalent conditions each ofwhich characterizes this relation. We demonstrate that with this equivalencerelation each equivalence class constitutes a lattice under the ordering of fuzzy setinclusion. Moreover, we study the behavior of these equivalence classes under theaction of a...

متن کامل

Relations and Equivalence Relations

In this section, we shall introduce a formal definition for the notion of a relation on a set. This is something we often take for granted in elementary algebra courses, but is a fundamental concept in mathematics i.e. the very notion of a function relies upon the definition of a relation. Following this, we shall discuss special types of relations on sets. 1. Binary Relations and Basic Definit...

متن کامل

Equivalence relations

A motivating example for equivalence relations is the problem of constructing the rational numbers. A rational number is the same thing as a fraction a/b, a, b ∈ Z and b 6= 0, and hence specified by the pair (a, b) ∈ Z× (Z−{0}). But different ordered pairs (a, b) can define the same rational number a/b. In fact, a/b and c/d define the same rational number if and only if ad = bc. One way to solv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Mathematics

سال: 2014

ISSN: 0001-8708

DOI: 10.1016/j.aim.2014.07.035